Decision problems and profinite completions of groups

We consider pairs of finitely presented, residually finite groups P\hookrightarrow\G for which the induced map of profinite completions \hat P\to \hat\G is an isomorphism. We prove that there is no algorithm that, given an arbitrary such pair, can determine whether or not $P$ is isomorphic to \G. We construct pairs for which the conjugacy problem in \G can be solved in quadratic time but the conjugacy problem in $P$ is unsolvable. Let $\mathcal J$ be the class of super-perfect groups that have a compact classifying space and no proper subgroups of finite index. We prove that there does not exist an algorithm that, given a finite presentation of a group \G and a guarantee that \G\in\mathcal J, can determine whether or not \G\cong\{1\}. We construct a finitely presented acyclic group \H and an integer $k$ such that there is no algorithm that can determine which $k$-generator subgroups of \H are perfect

The strong profinite genus of a finitely presented group can be infinite

We construct the first example of a finitely-presented, residually-finite group that contains an infinite sequence of non-isomorphic finitely-presented subgroups such that each of the inclusion maps induces an isomorphism of profinite completions.Comment: 10 pages, no figures. Final version to appear in Journal of the European Math. So

The Schur multiplier, profinite completions and decidability

We fix a finitely presented group $Q$ and consider short exact sequences $1\to N\to G\to Q\to 1$ with $G$ finitely generated. The inclusion $N\to G$ induces a morphism of profinite completions $\hat N\to \hat G$. We prove that this is an isomorphism for all $N$ and $G$ if and only if $Q$ is super-perfect and has no proper subgroups of finite index. We prove that there is no algorithm that, given a finitely presented, residually finite group $G$ and a finitely presentable subgroup $P\subset G$, can determine whether or not $\hat P\to\hat G$ is an isomorphism.Comment: 6 pages no figures. To appear in the Bulletin London Math So

Extrinsic versus intrinsic diameter for Riemannian filling-discs and van Kampen diagrams

The diameter of a disc filling a loop in the universal covering of a Riemannian manifold may be measured extrinsically using the distance function on the ambient space or intrinsically using the induced length metric on the disc. Correspondingly, the diameter of a van Kampen diagram filling a word that represents the identity in a finitely presented group can either be measured intrinsically its 1-skeleton or extrinsically in the Cayley graph of the group. We construct the first examples of closed manifolds and finitely presented groups for which this choice -- intrinsic versus extrinsic -- gives rise to qualitatively different min-diameter filling functions.Comment: 44 pages, 12 figures, to appear in the Journal of Differential Geometr

The isomorphism problem for profinite completions of residually finite groups

We consider pairs of finitely presented, residually finite groups $u:P\hookrightarrow \Gamma$. We prove that there is no algorithm that, given an arbitrary such pair, can determine whether or not the associated map of profinite completions $\hat{u}: \widehat{P} \to \widehat{\Gamma}$ is an isomorphism. Nor do there exist algorithms that can decide whether $\hat{u}$ is surjective, or whether $\widehat{P}$ is isomorphic to $\widehat{\Gamma}$.Comment: 12 page

Actions of automorphism groups of free groups on homology spheres and acyclic manifolds

For n at least 3, let SAut(F_n) denote the unique subgroup of index two in the automorphism group of a free group. The standard linear action of SL(n,Z) on R^n induces non-trivial actions of SAut(F_n) on R^n and on S^{n-1}. We prove that SAut(F_n) admits no non-trivial actions by homeomorphisms on acyclic manifolds or spheres of smaller dimension. Indeed, SAut(F_n) cannot act non-trivially on any generalized Z_2-homology sphere of dimension less than n-1, nor on any Z_2-acyclic Z_2-homology manifold of dimension less than n. It follows that SL(n,Z) cannot act non-trivially on such spaces either. When n is even, we obtain similar results with Z_3 coefficients.Comment: Typos corrected, reference and thanks added. Final version, to appear in Commetarii. Math. Hel

On the difficulty of presenting finitely presentable groups

We exhibit classes of groups in which the word problem is uniformly solvable but in which there is no algorithm that can compute finite presentations for finitely presentable subgroups. Direct products of hyperbolic groups, groups of integer matrices, and right-angled Coxeter groups form such classes. We discuss related classes of groups in which there does exist an algorithm to compute finite presentations for finitely presentable subgroups. We also construct a finitely presented group that has a polynomial Dehn function but in which there is no algorithm to compute the first Betti number of the finitely presentable subgroups.Comment: Final version. To appear in GGD volume dedicated to Fritz Grunewal